Improving the neural network method for finite element model updating using homogenous distribution of design points

In developing a neural network technique for a finite element model updating, researchers have been shown that the number of training samples and their quality, significantly affect the accuracy of the NN predication. In this study, based on the genetic algorithm (GA) method, we reduce the number of analyses required to develop the training pairs and reduce the amount of time for training the NN. In the other words, a uniform distribution of design points inside the design space will be obtained by means of this approach. To validate the efficiency of GA sample selection, random generation (RG) method is used for comparison. Two comparisons are made based on a numerical and experimental example. One is updated from 10 degrees of freedom lumped parameters system and the other is updated from a free–free beam using test data. The results indicate that the GA sample selection can reduce the number of training samples without affecting the accuracy of the NN predication. In our present study, also, the advantages of using frequency response function (FRF) data as input to the NN are kept and the drawback of having too many frequency points is overcome by the application of principal component analyses (PCA).     

Corrected mirror systems with double reflection

We propose objectives consisting of two mirrors with central holes for passage of a light beam. The optical layout ensures multiple reflection of rays from both mirrors. We consider several approaches to calculating the design parameters for which three and four aberrations do not occur. The objectives can be used in optical devices operating in the UV and IR regions of the spectrum. __________ Translated from Zhurnal Prikladnoi Spektroskopii, Vol. 74, No. 2, pp. 267–270, March–April, 2007.     

线性互补问题的异步并行多分裂松弛迭代算法

将求解线性方程组的异步并行多分裂松弛迭代算法推广到线性互补问题.当问题的系数矩阵为H-矩阵类时,证明了算法的全局收敛性.     

Gas solubility of carbon dioxide in poly(lactic acid) at high pressures: Thermal treatment effect

The sorption of carbon dioxide in glassy Poly(lactic acid) (PLA) films was studied by quartz crystal microbalance (QCM) at high pressures. Two thermal treatments, melted and quenched, were performed in PLA with two different L:D contents, 80:20 and 98:2, films and compared with a third thermal protocol, annealed, and used in a previous work. The results obtained show that for pressures higher than 2 MPa, the carbon dioxide solubility is larger in PLA 80:20 than in PLA 98:2, indicating that the L:D plays a dominant role on this property. The thermal treatments only affect the gas solubility in PLA 98:2. Sorption isotherms at temperatures 303, 313, and 323 K, below the glass transition temperature of the polymer, and pressures up to 5 MPa were measured and analyzed with three different models, the dual‐mode sorption model, the Flory–Huggins equation, and a modified dual‐mode sorption model where the Henry's law term was substituted by the Flory–Huggins equation. This last model performs especially well for CO₂ in PLA 80:20, due to the convex upward curvature of the solubility isotherms for that system. © 2007 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 45: 616–625, 2007     

Photoluminescence properties of the composite of porous alumina and poly (2,5-dibutoxy-1,4 phenylenevinylene)

The spin coating method was used to assemble polymer (Poly (2,5-dibutoxy-1,4-phenylenevinylene)) (DBO-PPV) into the pores of porous alumina which was prepared by anodization. Four peaks in the photoluminescence (PL) spectra of the composite, with contributions from the DBO-PPV and porous alumina, were found. It was also found that the light emitting from the porous alumina could excite the photoluminescence of DBO-PPV. The nanometer effect of the porous alumina can lead to a blue shift of 90 nm of the PL peaks of DBO-PPV.     

Solving large-scale semidefinite programs in parallel

We describe an approach to the parallel and distributed solution of large-scale, block structured semidefinite programs using the spectral bundle method. Various elements of this approach (such as data distribution, an implicitly restarted Lanczos method tailored to handle block diagonal structure, a mixed polyhedral-semidefinite subdifferential model, and other aspects related to parallelism) are combined in an implementation called LAMBDA, which delivers faster solution times than previously possible, and acceptable parallel scalability on sufficiently large problems. This work was supported in part by NSF grants DMS-0215373 and DMS-0238008.     

New variants of the generalized level method for minimization of convex nondifferentiable functions taking infinite values

New variants of the generalized level method for minimization of convex Lipschitz functions on a compact set with a nonempty interior are proposed. These variants include the well-known generalized and classical level methods. For the new variants, an estimate of the convergence rate is found, including the variants in which the auxiliary problems are solved approximately.     

求解非光滑方程组的Newton-GMRES方法的全局收敛性分析

1引言对于非光滑方程组F(y)=0(1.1)的求解,这里F:D(?)R~n→R~n是一个非光滑映射,目前主要有两种求解方法.一种方法是由Pang提出的.     

数学分析中的一题多解问题

通过两个积分 (一个是不定积分 ,一个是定积分 )及一个极限 ,说明如何灵活使用积分法解决积分问题 ,方法灵活、巧妙 ,适用范围广 .     

Conjectured statistics for the q,t-Catalan numbers

We introduce the distribution function F_n(q,t) of a pair of statistics on Catalan words and conjecture F_n(q,t) equals Garsia and Haiman's q,t-Catalan sequence C_n(q,t), which they defined as a sum of rational functions. We show that F_n,s(q,t), defined as the sum of these statistics restricted to Catalan words ending in s ones, satisfies a recurrence relation. As a corollary we are able to verify that F_n(q,t)=C_n(q,t) when t=1/q. We also show the partial symmetry relation F_n(q,1)=F_n(1,q). By modifying a proof of Haiman of a q-Lagrange inversion formula based on results of Garsia and Gessel, we obtain a q-analogue of the general Lagrange inversion formula which involves Catalan words grouped according to the number of ones at the end of the word.